Organization Detection Using Emergent Computing

Organization is a central concept in systems. In this paper an ant algorithm for detecting organizations is presented. In a discrete-time context, at each time-step, an organization corresponds to a set of closely interacting entities in a system. This system is mapped to a graph where nodes represent entities and edges represent interrelations. Several colonies of ants compete, and inside each colony, ants collaborate in order to colonize the graph. Detected organizations emerge from the global behavior of the ants. The proposed approach is compared to other methods on a graph where the organizations are already known. It is then tested on two real world graphs studied in the related literature.